Characterizing symmetric diametrical graphs of order12and diameter4
نویسندگان
چکیده
منابع مشابه
Classifying pentavalnet symmetric graphs of order $24p$
A graph is said to be symmetric if its automorphism group is transitive on its arcs. A complete classification is given of pentavalent symmetric graphs of order 24p for each prime p. It is shown that a connected pentavalent symmetric graph of order 24p exists if and only if p=2, 3, 5, 11 or 17, and up to isomorphism, there are only eleven such graphs.
متن کاملBipartite Diametrical Graphs of Diameter 4 and Extreme Orders
We provide a process to extend any bipartite diametrical graph of diameter 4 to an S-graph of the same diameter and partite sets. For a bipartite diametrical graph of diameter 4 and partite sets U and W , where 2m |U| ≤ |W |, we prove that 2 is a sharp upper bound of |W | and construct an S-graph G 2m, 2 in which this upper bound is attained, this graph can be viewed as a generalization of the ...
متن کاملCubic symmetric graphs of orders $36p$ and $36p^{2}$
A graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. In this paper, we classifyall the connected cubic symmetric graphs of order $36p$ and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.
متن کاملCharacterizing Graphs of Zonohedra
A classic theorem by Steinitz states that a graph G is realizable by a convex polyhedron if and only if G is 3-connected planar. Zonohedra are an important subclass of convex polyhedra having the property that the faces of a zonohedron are parallelograms and are in parallel pairs. In this paper we give characterization of graphs of zonohedra. We also give a linear time algorithm to recognize su...
متن کاملSymmetric Graphs and Flag Graphs
With any G-symmetric graph admitting a nontrivial G-invariant partition B, we may associate a natural ‘‘cross-sectional’’ geometry, namely the 1-design DðBÞ 1⁄4 ðB; BðBÞ; IÞ in which IC for 2B and C 2 BðBÞ if and only if is adjacent to at least one vertex in C, where B2B and BðBÞ is the neighbourhood of B in the quotient graph B of with respect to B. In a vast number of cases, the dual 1-design...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences
سال: 2002
ISSN: 0161-1712,1687-0425
DOI: 10.1155/s0161171202012474